Lower Bounds and Approximation Guarantees
نویسندگان
چکیده
منابع مشابه
Studies in Lower Bounding Probability of Evidence using the Markov Inequality
Computing the probability of evidence even with known error bounds is NP-hard. In this paper we address this hard problem by settling on an easier problem. We propose an approximation which provides high confidence lower bounds on probability of evidence but does not have any guarantees in terms of relative or absolute error. Our proposed approximation is a randomized importance sampling scheme...
متن کاملStudies in Lower Bounding Probabilities of Evidence using the Markov Inequality
Computing the probability of evidence even with known error bounds is NP-hard. In this paper we address this hard problem by settling on an easier problem. We propose an approximation which provides high confidence lower bounds on probability of evidence but does not have any guarantees in terms of relative or absolute error. Our proposed approximation is a randomized importance sampling scheme...
متن کاملApproximation Algorithms for Clustering Problems with Lower Bounds and Outliers
We consider clustering problems with non-uniform lower bounds and outliers, and obtain the first approximation guarantees for these problems. We have a setF of facilities with lower bounds {Li}i∈F and a setD of clients located in a common metric space {c(i, j)}i,j∈F∪D, and bounds k, m. A feasible solution is a pair ( S ⊆ F , σ : D 7→ S ∪ {out} ) , where σ specifies the client assignments, such ...
متن کاملScheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds
There has been recent success in using polyhedral formulations of scheduling problems not only to obtain good lower bounds in practice but also to develop provably good approximation algorithms. Most of these formulations rely on binary decision variables that are a kind of assignment variables. We present quite simple polynomial-time approximation algorithms that are based on linear programmin...
متن کاملOn the bounds in Poisson approximation for independent geometric distributed random variables
The main purpose of this note is to establish some bounds in Poisson approximation for row-wise arrays of independent geometric distributed random variables using the operator method. Some results related to random sums of independent geometric distributed random variables are also investigated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999